Pruned bit-reversal interleaver

ABSTRACT

A pruned bit-reversal interleaver supports different packet sizes and variable code rates and provides good spreading and puncturing properties. To interleave data, a packet of input data of a first size is received. The packet is extended to a second size that is a power of two, e.g., by appending padding or properly generating write addresses. The extended packet is interleaved in accordance with a bit-reversal interleaver of the second size, which reorders the bits in the extended packet based on their indices. A packet of interleaved data is formed by pruning the output of the bit-reversal interleaver, e.g., by removing the padding or properly generating read addresses. The pruned bit-reversal interleaver may be used in combination with various types of FEC codes such as a Turbo code, a convolutional code, or a low density parity check (LDPC) code.

PRIORITY CLAIM

This application is a continuation of divisional application U.S. Ser. No. 12/371,599, filed Feb. 14, 2009, entitled “Pruned Bit-Reversal Interleaver”, which claims the benefit of priority from U.S. application Ser. No. 11/022,485, filed Dec. 22, 2004, now U.S. Pat. No. 7,543,197, issued Jun. 2, 2009, all of which are assigned to the assignee of this application and are fully incorporated herein by reference for all purposes.

BACKGROUND

1. Field

The present invention relates generally to communication, and more specifically to techniques for interleaving data in a communication system.

2. Background

In a communication system, a transmitter typically encodes a packet of traffic data to generate a packet of code bits, interleaves or reorders the code bits, and modulates the interleaved bits to generate modulation symbols. The transmitter then processes and transmits the modulation symbols via a communication channel. The data transmission is degraded by impairments in the communication channel, such as thermal noise, interference, spurious signals, and so on. A receiver obtains a distorted version of the transmitted modulation symbols.

Encoding and interleaving allow the receiver to recover the transmitted traffic data in the presence of degradations in the received symbols. The encoding may include error detection coding that allows the receiver to detect for errors in the received traffic data and/or forward error correction (FEC) coding that allows the receiver to correct for errors in the received traffic data. FEC coding generates redundancy in the coded packet. This redundancy allows the receiver to recover the transmitted traffic data even if some errors are encountered during transmission. The interleaving reorders or shuffles the code bits in the packet so that code bits that are near each other are separated in time, frequency, and/or space during transmission. If a burst of errors occurs during transmission, then these errors are spread apart after the de-interleaving at the receiver, which improves decoding performance.

An interleaver is often designed to achieve good performance for packets of a particular size. (The term “size” and “length” are synonymous and are used interchangeably herein.) If the communication system supports multiple packet sizes, then a different interleaver is often designed and used for each packet size. The use of multiple interleavers for different packet sizes can complicate the interleaving at the transmitter and the de-interleaving at the receiver, especially if the system supports a wide range of packet sizes.

There is therefore a need in the art for techniques to efficiently perform interleaving for packets of different sizes.

SUMMARY

Techniques for interleaving packets of different sizes using a pruned bit-reversal interleaver are described herein. A bit-reversal interleaver takes in a packet of N_(br) input bits and reorders these bits based on their indices such that the bit at index i in the input packet is placed at index j in an interleaved packet, where j is a bit-reversed value of i. The bit-reversal interleaver operates on packet sizes that are powers of two. The pruned bit-reversal interleaver takes in a packet of N input bits and reorders these bits based on their indices, similar to the bit-reversal interleaver. However, N may be any value and is not restricted to powers of two. The pruned bit-reversal interleaver supports different packet sizes and variable code rates and further provides good spreading and puncturing properties, which can improve decoding performance as described below.

In an embodiment for interleaving data, a packet of input data of a first size is received. The packet is extended to a second size that is a power of two, e.g., by appending padding to the packet or by properly generating addresses for writing the packet to a memory. The extended packet is interleaved in accordance with a bit-reversal interleaver of the second size. A packet of interleaved data is then formed by pruning the output of the bit-reversal interleaver e.g., by removing the padding or by properly generating addresses for reading the packet from the memory.

The pruned bit-reversal interleaver may be used in combination with various types of FEC codes such as a Turbo code, a convolutional code, a low density parity check (LDPC) code, and so on. The pruned interleaving techniques may also be extended to other types of interleaver such as, for example, a linear congruential sequence (LCS) interleaver, a pseudo-random interleaver, and so on. For these other types of interleaver, the interleaver size may or may not be powers of two.

Various aspects and embodiments of the invention are described in further detail below.

BRIEF DESCRIPTION OF THE DRAWINGS

The features and nature of the present invention will become more apparent from the detailed description set forth below when taken in conjunction with the drawings in which like reference characters identify correspondingly throughout.

FIG. 1 shows a block diagram of a transmitter.

FIG. 2 shows a block diagram of a receiver.

FIG. 3 illustrates the operation of a 4-bit reversal interleaver.

FIG. 4 illustrates the operation of a 4-bit pruned reversal interleaver.

FIG. 5 shows a process for performing pruned bit-reversal interleaving.

FIG. 6 shows a block diagram of a channel interleaver.

FIG. 7 shows a Turbo encoder with a pruned bit-reversal interleaver.

FIG. 8 shows a convolutional encoder with a pruned bit-reversal interleaver.

FIG. 9 shows an LDPC encoder with a pruned bit-reversal interleaver.

DETAILED DESCRIPTION

The word “exemplary” is used herein to mean “serving as an example, instance, or illustration.” Any embodiment or design described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other embodiments or designs.

Communication systems are widely deployed to provide various communication services such as voice, packet data, and so on. These systems may be time, frequency, and/or code division multiple-access systems capable of supporting communication with multiple users simultaneously by sharing the available system resources. Examples of such multiple-access systems include Code Division Multiple Access (CDMA) systems, Multiple-Carrier CDMA (MC-CDMA), Wideband CDMA (W-CDMA), High-Speed Downlink Packet Access (HSDPA), Time Division Multiple Access (TDMA) systems, Frequency Division Multiple Access (FDMA) systems, and Orthogonal Frequency Division Multiple Access (OFDMA) systems.

FIG. 1 shows a block diagram of an embodiment of a transmitter 110 in a wireless communication system. At transmitter 110, a framing unit 114 receives traffic data (or information bits) from a data source 112, forms packets of information bits, and formats each information packet to generate a corresponding data packet. The formatting for each packet may include, for example, (1) generating a cyclic redundancy check (CRC) value for the information bits, (2) appending the CRC value, header, padding, tail bits, and so on to the information bits, and (3) scrambling all of the bits with a scrambling code to generate the data packet. An encoder 116 encodes each data packet in accordance with a coding scheme and provides a corresponding coded packet. The coding scheme may comprise a Turbo code, a convolutional code, an LDPC code, an irregular repeat-accumulate (IRA) code (which may be considered as a class of LDPC codes), a block code, some other FEC code, or a combination thereof. The encoding generates redundancy in the coded packet, which increases the reliability of data transmission.

A channel interleaver 118 interleaves (i.e., reorders or shuffles) the code bits in each coded packet based on an interleaving scheme and provides a corresponding interleaved packet. The interleaving provides time, frequency, and/or spatial diversity for the coded packet and may be performed as described below. A puncturing unit 120 punctures (i.e., deletes) zero or more bits in each interleaved packet to obtain the desired number of bits for the packet. Encoder 116 may implement a base code that generates N_(C) code bits for N_(D) data bits in a packet, where N_(D)≧1 and N_(C) is dependent on N_(D) and the code rate of the base code. For example, if the base code has a rate of R_(base)=⅕, then encoder 116 generates five code bits for each data bit, and N_(C)=5N_(D). If N_(T) code bits are to be transmitted for the packet, where N_(T)<N_(C), then puncturing unit 120 deletes N_(C)−N_(T) code bits and provides the remaining NT code bits for the packet. The actual code rate for the packet is then R=N_(D)/N_(T), which is higher than the base code rate of R_(base)=⅕. Puncturing unit 120 provides an output packet containing the unpunctured bits in each interleaved packet.

A symbol mapper 122 maps the bits in each output packet in accordance with a modulation scheme and provides modulation symbols. The symbol mapping may be achieved by (1) grouping sets of B bits to form B-bit binary values, where B≧1, and (2) mapping each B-bit binary value to a point in a signal constellation for the selected modulation scheme. Each modulation symbol is a complex value corresponding to a mapped signal point for a set of B bits. Symbol mapper 122 provides a packet of modulation symbols for each output packet.

A transmitter unit (TMTR) 124 processes the modulation symbols in accordance with the design of the system and generates data samples. For example, transmitter unit 124 may perform orthogonal frequency division multiplexing (OFDM) modulation, spectral spreading, and so on. Transmitter unit 124 further conditions (e.g., converts to analog, filters, amplifies, and frequency upconverts) the data samples to generate a modulated signal, which is transmitted via an antenna 126.

A controller 130 controls the operation of various processing units at transmitter 110. For example, controller 130 may select a particular format to use for each data packet. The selected format may be associated with various parameters for the data packet such as, for example, the size of the packet, the coding scheme or code rate to use for the packet, the modulation scheme to use for the packet, and so on. Controller 130 may then generate various controls for framing unit 114, encoder 116, channel interleaver 118, puncturing unit 120, and symbol demapper 122 based on the selected format for each packet. A memory unit 132 stores program codes and data used by controller 130.

FIG. 2 shows a block diagram of an embodiment of a receiver 150 in the system. At receiver 150, an antenna 152 receives the transmitted signal from transmitter 110 and provides a received signal to a receiver unit (RCVR) 154. Receiver unit 154 processes the received signal in a manner complementary to the processing performed by transmitter unit 124 and provides received symbols. A symbol demapper 156 demodulates the received symbols for each packet in accordance with the modulation scheme used for the packet and provides a packet of demodulated data. An erasure insertion unit 158 inserts erasures for the punctured code bits in each packet. Erasures are dummy values that are given appropriate weight in the decoding process.

A channel deinterleaver 160 deinterleaves the demodulated data in each packet in a manner complementary to the interleaving performed by channel interleaver 118 and provides a packet of deinterleaved data. A decoder 162 decodes each packet of deinterleaved data and provides a packet of decoded data to CRC checker 164. Decoder 162 performs decoding in a manner complementary to the encoding performed by encoder 116. For example, decoder 162 may be a Turbo decoder if encoder 116 performs Turbo encoding, a Viterbi decoder if encoder 116 performs convolutional encoding, or an LDPC decoder if encoder 116 performs LDPC encoding. CRC checker 164 checks each decoded packet based on the appended CRC value and determines whether the packet was decoded correctly or in error. CRC checker 164 provides correctly decoded packets to a data sink 166.

Controller 170 controls the operation of various processing units at receiver 150. For example, controller 170 may be informed of the format for each packet and may generate the appropriate controls for symbol demapper 156, erasure insertion unit 158, channel deinterleaver 160, and decoder 162. Memory unit 172 stores program codes and data used by controller 170.

At transmitter 110 in FIG. 1, channel interleaver 118 reorders the code bits in each coded packet such that bit errors encountered by receiver 150 for the packet are distributed across the packet after the complementary deinterleaving by channel deinterleaver 160. Good distribution of bit errors can improve decoding performance, and hence data transmission performance.

Channel interleaver 118 should provide the following:

Good spreading property so that code bits that are close to each other before channel interleaving are spaced far apart after the channel interleaving; and

Regular or approximately regular puncturing patterns so that evenly spaced code bits from encoder 116 are selected for transmission.

Good spreading property can provide more diversity to combat deleterious path effects such as fading, multipath, interference, and so on. Regular or approximately regular puncturing patterns can improve performance for some coding schemes. A regular puncturing pattern selects evenly spaced bits (e.g., every k-th bits) in a sequence for transmission. An irregular puncturing pattern, such as a pseudo-random puncturing pattern, selects bits that are not uniformly spaced in a sequence for transmission. Some coding schemes such as Turbo codes can provide better performance when used in combination with regular puncturing patterns instead of irregular (e.g., pseudo-random) puncturing patterns.

In an embodiment, channel interleaver 118 is implemented as a pruned bit-reversal interleaver that can provide both of the desired properties described above for different packet sizes and code rates. A pruned bit-reversal interleaver is based on a conventional bit-reversal interleaver that takes in a packet of N_(br) code bits and reorders these code bits based on their indices, as described below. The bit-reversal interleaver provides the two properties described above but only operates on packet sizes that are powers of two, so that N_(br)=2^(L), where L is a positive integer value. A pruned bit-reversal interleaver takes in a packet of N code bits and reorders these code bits based on their indices, where N may be any integer value and is not restricted to powers of two. The pruned bit-reversal interleaver also has the two properties described above.

FIG. 3 illustrates the operation of a 4-bit reversal interleaver on a coded packet with 16 code bits. The 16 bit positions within the coded packet are given indices of 0 through 15. The 16 code bits in the coded packet are denoted as b₀, b₁, b₂, . . . , b₁₅, where code bit b_(i) is at bit index i in the coded packet.

The bit-reversal interleaving scheme operates as follows. For each code bit b_(i), where i=0, 1, . . . 15, bit index i of code bit b_(i) is expressed in binary form using four binary bits. The four binary bits are then reversed so that the first, second, third and fourth binary bits for index i are moved to the fourth, third, second and first bit positions, respectively. The four reversed bits form a bit-reversed value of j=π(i), where π(i) denotes the bit reversal operation on the binary representation of i. Code bit b_(i) is then provided at bit index j in the interleaved packet. For example, bit index i=3 is expressed in binary form as ‘0011’, the reversed bits are ‘1100’, and the bit-reversed value is j=12. Code bit b₃ in the coded packet is then mapped to bit index 12 in the interleaved packet. FIG. 3 shows the mapping of the 16 code bits in the coded packet to the 16 bit positions in the interleaved packet.

An L-bit reversal interleaver satisfies the following spreading property:

a. If |a−b|<2^(k), then |π(a)−π(b)|≧2^(L−k−1),   Eq (1)

where a and b are any two bit indices for the coded packet;

-   -   a. |a−b| denotes the distance between bit indices a and b;     -   b. π(a) is the bit-reversed value for bit index a; and     -   c. π(b) is the bit-reversed value for bit index b.

Equation (1) indicates that if bit indices a and b differ in at least one of their k least significant bits, then π(a) and π(b) differ in at least one of their k most significant bits. Thus, if two code bits are separated by less than 2^(k) bit positions in the coded packet, then these two code bits are separated by at least 2^(L−k−1) bit positions in the interleaved packet. For example, if L=10 and k=2, then code bits that are less than four bit positions away from each other in the coded packet are separated by at least 128 bit positions in the interleaved packet.

The L-bit reversal interleaver provides regular or approximately regular puncturing patterns. After the interleaving, the first N_(br)/2 code bits in the interleaved packet are those with indices divisible by 2. Similarly, the first N_(br)/4 code bits in the interleaved packet have indices divisible by 4, the first N_(br)/8 code bits have indices divisible by 8, and so on. If the code bits in the interleaved packet are subsequently punctured, then puncturing all but the first N_(br)/2 code bits would result in transmission of code bits that are spaced apart by two in the coded packet. In general, puncturing all but the first N_(br)/2^(k) code bits in the interleaved packet would result in transmission of code bits that are spaced apart by 2^(k) in the coded packet. Thus, regular puncturing patterns may be achieved when the “puncturing factor” is a power of two, or 2^(k), and only N_(br)/2^(k) code bits are retained among the N_(br) total code bits in the coded packet. For other puncturing factors that are not powers of two, approximately regular puncturing patterns are achieved with the bit-reversal interleaver.

FIG. 4 illustrates the operation of a pruned 4-bit reversal interleaver on a coded packet with 11 code bits. The 11 bit positions within the coded packet are given indices of 0 through 10. The 11 code bits in the coded packet are denoted as b₀, b₁, b₂, . . . , b₁₀, where code bit b_(i) is at bit index i in the coded packet.

The pruned bit-reversal interleaving scheme operates as follows. The coded packet is extended to length 16, which is the nearest power of two that is greater than the coded packet size of 11. The packet extension may be achieved by appending five padding bits, which are denoted as e₁₁, e₁₂, . . . , e₁₅, at the end of the 11 coded bits to form an extended packet with 16 bits. Normal 4-bit reversal interleaving is then performed on the bits in the extended packet, as described above for FIG. 3, to obtain a bit-reversed packet. Thus, bit b_(i) at index i in the extended packet is mapped to bit index j in the bit-reversed packet, where j=π(i) and π(i) denotes the bit reversal operation on i. The five padding bits in the bit-reversed packet are then deleted to obtain an interleaved packet containing the 11 coded bits.

A pruned (L+1)-bit reversal interleaver satisfies the following spreading property:

a. If |a−b|<2^(k), then |π(a)−π(b)|≧2^(L−k−1).   Eq (2)

Equation (2) indicates that if two code bits are separated by less than 2^(k) bit positions in the coded packet, then these two code bits are separated by at least 2^(L−k−1) bit positions in the interleaved packet. The spreading factors achieved by the pruned bit reversal interleaver are nearly the same as those achieved by the bit-reversal interleaver. The additional advantage of the pruned bit-reversal interleaver is that it may be used for different packet sizes.

The pruned bit reversal interleaver also provides regular or approximately regular puncturing patterns. After the interleaving, the first N/2 code bits in the interleaved packet have indices divisible by 2, the first N/4 code bits in the interleaved packet have indices divisible by 4, the first N /8 code bits have indices divisible by 8, and so on. If the code bits in the interleaved packet are subsequently punctured, then puncturing all but the first N/2^(k) code bits in the interleaved packet would result in transmission of code bits that are spaced apart by 2^(k) bit positions in the coded packet. Thus, regular puncturing patterns are obtained when the puncturing factor is a power of two and approximately regular puncturing patterns are obtained when the puncturing factor is not a power of two.

FIG. 5 shows a process 500 for performing pruned bit-reversal interleaving. Initially, a packet containing N input bits and having a size of N is received (block 510). If the packet size is not a power of two (i.e., if 2^(L)<N<2^(L+1)), then an (L+1)-bit reversal interleaver with pruning is used to interleave the N input bits in the packet. To perform the pruned bit-reversal interleaving, the packet is first extended to length 2^(L+1) (block 512). This may be achieved by appending (2^(L+1)−N) padding bits at the end of the packet. Alternatively, the packet extension may be achieved by properly generating bit addresses used for interleaving, as described below. In any case, the extended packet of length 2^(L+1)is interleaved with an (L+1)-bit reversal interleaver (block 514). A packet containing N interleaved bits is then formed, e.g., by deleting the (2^(L+1)−N) padding bits if they were appended to the packet (block 516).

FIG. 6 shows a block diagram of a channel interleaver 118 x, which is one embodiment of channel interleaver 118 at transmitter 110 in FIG. 1. Channel interleaver 118 x includes a memory unit 610, an address generator 620, and a look-up table 630. Channel interleaver 118 x receives input bits (which are code bits from encoder 116) and stores these input bits in memory unit 610 at locations determined by address generator 620. Channel interleaver 118 x provides interleaved bits from memory unit 610 at locations determined by address generator 620. Address generator 620 receives an indication of the start of each incoming packet and its size N and generates the proper addresses for writing the input bits into memory unit 610. Address generator 620 also generates the proper addresses for reading or retrieving the interleaved bits from memory unit 610.

The interleaving for the pruned bit reversal interleaver may be performed in several manners. In a first embodiment, the input bits in a packet are stored in a linear order in memory unit 610 and retrieved in an interleaved order from memory unit 610. For this embodiment, address generator 620 receives the start of an incoming packet and generates sequential addresses for the packet. Address generator 620 also generates bit-reversed addresses for reading the interleaved bits from memory unit 610. In a second embodiment, the input bits in a packet are stored in an interleaved order in memory unit 610 and retrieved in a linear order from memory unit 610. For this embodiment, address generator 620 receives the start of an incoming packet and generates bit-reversed addresses for writing the input bits to memory unit 610. Address generator 620 also generates sequential addresses for reading the interleaved bits from memory unit 610.

For both embodiments, address generator 620 can generate the bit-reversed addresses such that padding of the input packet is not needed. The bit-reversed addresses may be generated as follows. The input packet contains N input bits at indices of 0 through N−1. Address generator 620 first determines the required number of bits (L+1) for the bit-reversal interleaver, where (L+1) is the smallest integer such that N≦2^(L+1). A counter within address generator 620 is initialized to zero. Address generator 620 then forms a tentative bit-reversed address j as j=π(i), where π(i) is the bit reversal operation on the current counter value i. The bit-reversed address j is accepted if it is less than N and rejected otherwise. Address generator 620 provides the bit-reversed address j if it is accepted. In either case, the counter is incremented and the new counter value is used to generate the next tentative bit-reversed address. The address generation process continues until all N valid bit-reversed addresses are generated. The padding or packet extension to length 2^(L+1) is effectively achieved by properly generating the bit-reversed addresses.

Address generator 620 may generate the bit-reversed addresses on the fly as they are needed to write the input bits into memory unit 610 or to read the interleaved bits from memory unit 610. Alternatively, the bit-reversed addresses may be stored in look-up table 630 and accessed as they are needed.

FIG. 6 shows one embodiment of channel interleaver 118, which may also be implemented in other manners. Channel deinterleaver 160 at receiver 150 in FIG. 2 may be implemented using the structure shown in FIG. 6.

The pruned bit reversal interleaver may be used in combination with various types of FEC codes, such as a Turbo code, a convolutional code, an LDPC code, and so on. Several exemplary embodiments of encoder 116, channel interleaver 118, and puncturing unit 120 for different FEC codes are described below.

FIG. 7 shows a block diagram of an encoder 116 a, a channel interleaver 118 a, and a puncturing unit 120 a, which are one embodiment of encoder 116, channel interleaver 118, and puncturing unit 120, respectively, at transmitter 110 in FIG. 1. For this embodiment, encoder 116 a implements a rate ⅕ parallel-concatenated convolutional code, which is commonly called a Turbo code. Encoder 116 a provides five code bits for each data bit.

Encoder 116 a includes two constituent encoders 712 a and 712 b, two multiplexers (Mux) 714 a and 714 b, and a code interleaver 716. Encoder 116 a receives a data packet containing N_(D) data bits, which is denoted as {x}, and provides the N_(D) data bits as a sequence of N_(D) systematic bits for the coded packet. Constituent encoder 712 a receives the data bits {x}, encodes the data bits in accordance with a first generator polynomial G₁(D), and generates a first sequence of N_(D) parity bits, which is denoted as {y}. Constituent encoder 712 a also encodes the same data bits in accordance with a second generator polynomial G₂(D) and generates a second sequence of N_(D) parity bits, which is denoted as {z₁}. Code interleaver 716 receives and interleaves the N_(D) data bits in accordance with a particular interleaving scheme. For example, code interleaver 716 may implement an LCS interleaving scheme, a pseudo-random interleaving scheme, and so on, as is known in the art. Constituent encoder 712 b receives the N_(D) interleaved bits from code interleaver 716, encodes the interleaved bits in accordance with the first generator polynomial G₁(D), and generates a third sequence of N_(D) parity bits, which is denoted as {y₂}. Constituent encoder 712 b also encodes the same interleaved bits in accordance with the second generator polynomial G₂(D) and generates a fourth sequence of N_(D) parity bits, which is denoted as {z₂}. Constituent encoders 712 a and 712 b may also provide tail parity bits.

Multiplexer 714 a receives the parity bit sequences {y₁} and {y₂}, multiplexes these two sequences together, and provides a parity bit sequence {y} for the first generator polynomial G₁(D). The first N_(D) parity bits in sequence {y} are from sequence {y₁}, and the last N_(D) parity bits in sequence {y} are from sequence {y₂} Similarly, multiplexer 714 b receives the parity bit sequences {z₁} and {z₂}, multiplexes these two sequences together, and provides a parity bit sequence {z} for the second generator polynomial G₂(D). The first N_(D) parity bits in sequence {z} are from sequence {z₁}, and the last N_(D) parity bits in sequence {z} are from sequence {z₂}.

For the data packet with N_(D) input bits, encoder 116 a provides the sequence of N_(D) systematic bits (which are equal to the N_(D) input bits), the sequence of 2N_(D) parity bits {y} generated with the first generator polynomial, and the sequence of 2N_(D) parity bits {z} generated with the second generator polynomial. The sequence of systematic bits and the two sequences of parity bits together make up the 5N_(D) code bits of a coded packet generated by encoder 116 a for the data packet.

Channel interleaver 118 a includes pruned bit-reversal interleavers 722, 724 a, and 724 b, each of which may be implemented as shown in FIG. 6. Interleaver 722 performs pruned bit-reversal interleaving on the sequence of N_(D) systematic bits {x} and provides an interleaved sequence {x_(int)} Interleaver 722 utilizes a bit-reversal interleaver of size N′_(D), which is the nearest power of two that is equal to or greater than N_(D). Interleaver 724 a performs pruned bit-reversal interleaving on the sequence of 2N_(D) parity bits {y} and provides an interleaved sequence {y_(int)}. Interleaver 724 a utilizes a bit-reversal interleaver of size 2N′_(D), which is the nearest power of two that is equal to or greater than 2N_(D). Similarly, interleaver 724 b performs pruned bit-reversal interleaving on the sequence of 2N_(D) parity bits {z} and provides an interleaved sequence {z_(int)}. Interleaver 724 b also utilizes a bit-reversal interleaver of size 2N′_(D). Because the sequence {y} contains N_(D) parity bits from sequence {y₁} followed by N_(D) parity bits from sequence {y₂}, the even-indexed parity bits in {y_(int)} are from {y₁} and the odd-indexed parity bits in {y_(int)} are from {y₂}. Similarly, the even-indexed parity bits in {z_(int)} are from {z₁} and the odd-indexed parity bits in {z_(int)} are from {z₂}. The three sequences {x_(int)}, {y_(int)}, and {z_(int)} form the interleaved packet.

Puncturing unit 120 a includes puncturing units 732, 734, and 736 and a multiplexer 738. Puncturing unit 732 receives sequence {x_(int)}, punctures zero or more code bits, and provides a punctured sequence {x_(int)}. Puncturing unit 734 receives sequence {y_(int)}, punctures or truncates zero or more code bits at the end of sequence {y_(int)}, and provides a punctured sequence {y_(p)}. Similarly, puncturing unit 736 receives sequence {z_(int)}, punctures zero or more code bits at the end of sequence {z_(int)}, and provides a punctured sequence {z_(p)}. For pruned bit-reversal interleaver 734 and 736, the code bits in each sequence are punctured starting at the end of the sequence and traversing toward the start of the sequence. The interleaved systematic bits in sequence {x_(int)} are typically not punctured or are punctured last.

Encoder 116 a implements a rate ⅕ Turbo code that generates N_(C)=5N_(D) code bits for N_(D) data bits in the packet. The number of code bits to puncture may be determined by the coded packet size and the output packet size. If the desired output packet size is N_(P) and the coded packet size is N_(C), then (N_(C)−N_(P)) code bits are punctured to obtain an output packet of size N_(P). Alternatively, the number of code bits to puncture may be determined by the size of the coded packet and the desired code rate, which is given as R=N_(D)/N_(P). If the coded packet size is N_(C) and the desired code rate is R, then (N_(C)−N_(D)/R) code bits are punctured to obtain the desired code rate. For example, a code rate of ⅓ may be obtained by puncturing (N_(C)−3N_(D))=2N_(D) code bits.

The puncturing may be performed in various manners. In one puncturing scheme, to puncture (N_(C)−N_(P)) code bits to generate an output packet of size of N_(P), the code bits in sequence {z_(int)} are punctured first, then the code bits in sequence {y_(int)} are punctured next if needed, and the code bits in sequence {x_(int)} are punctured last if needed. A rate ⅓ Turbo code is obtained when all 2N_(D) code bits in sequence {z_(int)} are punctured. In another puncturing scheme, (N_(C)−N_(P))/2 code bits in sequence {y_(int)} and (N_(C)−N_(P))/2 code bits in sequence {z_(int)} are punctured to obtain an output packet of size N_(P). In any case, multiplexer 738 receives the three sequences {x_(p)}, {y_(p)}, and {z_(p)}, provides sequence {x_(p)}, then sequence {y_(p)}, and then sequence {z_(p)} last for the output packet, which is denoted as {s}.

Channel interleaver 118 a provides regular puncturing patterns for the parity bits for many code rates, including rates ⅘, ⅔, ½, ⅓, ¼ and ⅕. Channel interleaver 118 a provides approximately regular puncturing patterns for other code rates. Channel interleaver 118 a also provides good spreading property, as described above. A Turbo decoder can achieve improved performance with the regular or approximately regular puncturing patterns and the good spreading factor provided by channel interleaver 118 a.

The puncturing may also be combined with the channel interleaving so that bits that are to be unpunctured are not stored in memory. For a given pruned bit-reversal interleaver, if only K interleaved bits from the interleaver are to be provided for the output packet, then code bits with indices greater than K in the interleaved sequence may be deleted by the interleaver.

FIG. 7 shows encoder 118 a implementing a rate ⅕ Turbo code. For a rate ⅓ Turbo code, constituent encoder 712 a generates a single sequence of parity bits {y₁} based on a single generator polynomial G(D), and constituent encoder 712 b also generates a single sequence of parity bits {y₂} based on the same generator polynomial G(D). Multiplexer 714 a multiplexes sequences {y₁} and {y₂} into a single sequence {y}. Pruned bit-reversal interleaver 724 a interleaves the parity bits in sequence {y} and provides an interleaved sequence {y_(int)}. Multiplexer 714 b, pruned bit-reversal interleaver 724 b, and puncturing unit 736 are not needed for the rate ⅓ Turbo code.

FIG. 8 shows a block diagram of an encoder 116 b, a channel interleaver 118 b, and a puncturing unit 120 b, which are another embodiment of encoder 116, channel interleaver 118, and puncturing unit 120, respectively, at transmitter 110. For this embodiment, encoder 116 b implements a rate 1/M convolutional code that provides M code bits for each data bit. Encoder 116 b includes a convolutional encoder 812 and a multiplexer 814. Convolutional encoder 812 receives the data bits {x}, encodes the data bits in accordance with M different generator polynomials, and generates M sequences of code bits, which are denoted as {c₁} through {c_(M)}. Multiplexer 814 receives the M code bit sequences, provides sequence {c₁} first, then sequence {c₂} next, and so on, and then sequence {c_(M)} last for the coded packet, which is denoted as {c}. This multiplexing scheme ensures that approximately equal number of code bits from each generator polynomial is selected for the output packet.

Channel interleaver 118 b includes a pruned bit-reversal interleaver 822 that may be implemented as shown in FIG. 6. Interleaver 822 performs pruned bit-reversal interleaving on the code bit sequence {c} and provides an interleaved sequence {c_(int)}. Interleaver 822 utilizes a bit-reversal interleaver of a size that is the nearest power of two greater than or equal to the input sequence size. The interleaved sequence {c_(int)} forms the interleaved packet. Puncturing unit 120 b includes a puncturing unit 832 that punctures zero or more code bits in the interleaved sequence {c_(int)} (e.g., starting from the end of sequence {c_(int)}) and provides an output packet {s} of the desired size.

FIG. 9 shows a block diagram of an encoder 116 c, a channel interleaver 118 c, and a puncturing unit 120 c, which are yet another embodiment of encoder 116, channel interleaver 118, and puncturing unit 120, respectively, at transmitter 110. For this embodiment, encoder 116 c includes an LDPC encoder 912. LDPC encoder 912 receives the data bits for a data packet {x}, encodes the data bits in accordance with a generator matrix G, provides the data bits as a sequence of systematic bits, and provides a sequence of parity bits, which is denoted as {q}. The generator matrix G is formed based on a parity check matrix H and such that the desired number of code bits is generated. The sequences {x} and {q} form a coded packet.

Channel interleaver 118 c includes pruned bit-reversal interleavers 922 and 924, each of which may be implemented as shown in FIG. 6. Interleaver 922 performs pruned bit-reversal interleaving on the sequence of systematic bits {x} and provides an interleaved sequence {x_(int)}. Interleaver 924 performs pruned bit-reversal interleaving on the sequence of parity bits {q} and provides an interleaved sequence {q_(int)}. Interleavers 922 and 924 utilize bit-reversal interleavers of the smallest possible size for their respective sequences. The sequences {x_(int)} and {q_(int)} form an interleaved packet. Puncturing unit 120 c includes a multiplexer 932 that receives and multiplexes sequences {x_(int)} and {q_(int)} and provides an output packet {s} of the desired size. Since sequences {x} and {q} are collectively of the desired size, puncturing is not needed.

FIG. 9 shows one type of LDPC code that generates both systematic and parity bits. Other LDPC codes may generate only parity bits and no systematic bits. In this case, the channel interleaving may be performed using one pruned bit-reversal interleaver, in the manner described above in FIG. 8 for the convolutional code.

FIGS. 7, 8, and 9 show the use of the pruned bit-reversal interleaver with three different types of FEC codes. Similar interleavers may be used for other codes where spreading properties and/or regular puncturing patterns are important. The pruned-bit reversal interleaver may be used wherever the properties of a bit-reversal interleaver are desired, but the interleaver size is not a power of two.

For clarity, the interleaving techniques have been described specifically for a pruned bit-reversal interleaver that uses a bit-reversal interleaver having a size that is a power of two. These techniques may also be used for other types of interleaver, such as an LCS-type interleaver, a pseudo-random interleaver, and so on. For example, an LCS-type interleaver or a pseudo-random interleaver of a predetermined size may be used with pruning to support different packet sizes. For any given interleaver of a predetermined size, an input packet may be extended to the interleaver size if it is smaller than the predetermined size (e.g., by appending padding or properly generating addresses). Interleaving may then be performed in the normal manner by the interleaver. The interleaved packet with the original packet size is then formed by pruning (e.g., removing the padding or properly generating addresses). The interleaving techniques may also be used for other interleaver sizes that are not powers of two.

Referring back to FIG. 1, the output bits from puncturing unit 120 are mapped to modulation symbols by symbol mapper 122. For an OFDM-based system, such as an Orthogonal Frequency Division Multiple Access (OFDMA) system, one modulation symbol may be sent on each subband in each OFDM symbol period. A given packet of modulation symbols may be sent on multiple (S) subbands in multiple (T) OFDM symbol periods. For some scenarios, improved performance may be achieved by providing the modulation symbols across time first and then across frequency. In this case, T modulation symbols may be provided to a first subband for T symbol periods, then the next T modulation symbols may be provided to a second subband for the same T symbol periods, and so on. For some other scenarios, improved performance may be achieved by providing the modulation symbols across frequency first and then across time. In this case, S modulation symbols may be provided to the S subbands for a first OFDM symbol period, then the next S modulation symbols may be provided to the S subbands for a second OFDM symbol period, and so on.

The interleaving techniques described herein may be implemented by various means. For example, these techniques may be implemented in hardware, software, or a combination thereof For a hardware implementation, the processing units used to perform interleaving or deinterleaving may be implemented within one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), processors, controllers, micro-controllers, microprocessors, other electronic units designed to perform the functions described herein, or a combination thereof.

For a software implementation, the interleaving techniques may be implemented with modules (e.g., procedures, functions, and so on) that perform the functions described herein. The software codes may be stored in a memory unit (e.g., memory unit 132 in FIG. 1 or memory unit 172 in FIG. 2) and executed by a processor (e.g., controller 130 in FIG. 1 or controller 170 in FIG. 2). The memory unit may be implemented within the processor or external to the processor.

The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein. 

1. A method of processing data in a communication system, comprising: encoding a sequence of data bits in accordance with a convolutional code to generate a sequence of code bits of a first size; appending padding to the packet of input data to extend the packet to a second size; interleaving the sequence of code bits in accordance with an interleaving scheme for a second size to generate a sequence of interleaved code bits, wherein the interleaving the sequence of code bits comprises interleaving the sequence of code bits in accordance with a bit-reversal interleaving scheme for the second size that is a power of two; forming a packet of interleaved data with the sequence of interleaved code bits; and deleting a portion of the sequence of interleaved code bits to generate an output packet.
 2. A method of processing data in a communication system, comprising: encoding a sequence of data bits in accordance with a convolutional code to generate a sequence of code bits of a first size; and generating addresses to interleave the packet of input data in accordance with a bit-reversal interleaving scheme for a second size, the second size being a power of two and greater than the first size.
 3. Apparatus for processing data in a communication system, comprising: means for encoding a sequence of data bits in accordance with a Turbo code to generate a sequence of systematic bits of a first size, a first sequence of parity bits of a second size, and a second sequence of parity bits of the second size; means for interleaving the sequence of systematic bits in accordance with a bit-reversal interleaving scheme for a first predetermined size to generate a sequence of interleaved systematic bits, wherein the first predetermined size is a power of two and is equal to or greater than the first size; means for interleaving the first sequence of parity bits in accordance with the bit-reversal interleaving scheme for a second predetermined size to generate a first sequence of interleaved parity bits, wherein the second predetermined size is a power of two and is equal to or greater than the second size; means for interleaving the second sequence of parity bits in accordance with the bit-reversal interleaving scheme for the second predetermined size to generate a second sequence of interleaved parity bits; and means for forming a packet of interleaved data with the sequence of interleaved systematic bits and the first and second sequences of interleaved parity bits.
 4. The apparatus of claim 3, further comprising: means for deleting a portion of the second sequence of interleaved parity bits, if needed, to generate an output packet.
 5. The apparatus of claim 4, further comprising: means for deleting a portion of the first sequence of interleaved parity bits, if needed, to generate the output packet.
 6. The apparatus of claim 5 and further comprising: means for deleting a portion of the systematic bits, if needed, to generate the output packet.
 7. The apparatus of claim 3 and further comprising: means for adding padding bits to the sequence of data bits.
 8. The apparatus of claim 7 and further comprising: means for deleting a portion of the padding bits.
 9. The apparatus of claim 3 and further comprising: means for generating addresses for the sequence of systematic bits.
 10. The apparatus of claim 9 wherein said means for generating addresses comprises a look-up table.
 11. The apparatus of claim 3 wherein said at least one of said means for interleaving the sequence of systematic bits is a pruned (L+1) bit interleaver satisfying a spreading property as follows: if |a−b|<2^(k), then |π(a)−π(b)≧2^(L−k−1). where a and b are any two bit indices for the coded packet; |a|b| denotes the distance between bits with indices a and b; π(a) is the bit-reversed value for bit index a; π(b) is the bit-reversed value for bit index b; L is a positive integer; and k is a positive integer.
 12. Apparatus for processing data in a communication system, comprising: means for encoding a sequence of data bits in accordance with a convolutional code to generate a sequence of code bits of a first size; means for appending padding bits to the sequence of data bats to extend the packet to a second size; means for interleaving the extended packet of bits in accordance with a bit reversal interleaving scheme for a second size that is a power of two greater than the sequence of code bits of a first size to generate a sequence of interleaved code bits and for forming a packet of interleaved data bits and padding bits; and means for puncturing for deleting a portion of the packet of interleaved code bits and padding bits to generate an output packet.
 13. The apparatus of claim 12 wherein said at least one of said means for interleaving the sequence of systematic bits is a pruned (L+1) bit interleaver satisfying a spreading property as follows: if |a−b|<2^(k), then |π(a)−π(b)|≧2^(L−k−1). where a and b are any two bit indices for the coded packet; |a−b| denotes the distance between bits with indices a and b; π(a) is the bit-reversed value for bit index a; π(b) is the bit-reversed value for bit index b; L is a positive integer; and k is a positive integer. 